m at h . ST ] 1 4 Se p 20 07 Adjusted Viterbi training for hidden Markov models

نویسندگان

  • Jüri Lember
  • Alexey Koloydenko
چکیده

To estimate the emission parameters in hidden Markov models one commonly uses the EM algorithm or its variation. Our primary motivation, however, is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent. We propose an alternative to the Viterbi training – adjusted Viterbi training – that has the same order of computational complexity as Viterbi training but gives more accurate estimators. Elsewhere, we studied the adjusted Viterbi training for a special case of mixtures, supporting the theory by simulations. This paper proves the adjusted Viterbi training to be also possible for more general hidden Markov models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM

Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...

متن کامل

Adjusted Viterbi training for hidden Markov models

We consider estimation of the emission parameters in hidden Markov models. Commonly, one uses the EM algorithm for this purpose. However, our primary motivation is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent...

متن کامل

The adjusted Viterbi training for hidden Markov models

The EM procedure is a principal tool for parameter estimation in the hidden Markov models. However, applications replace EM by Viterbi extraction, or training (VT). VT is computationally less intensive, more stable and has more of an intuitive appeal, but VT estimation is biased and does not satisfy the following fixed point property. Hypothetically, given an infinitely large sample and initial...

متن کامل

Hidden Markov Models and the Viterbi algorithm

is understood to have N hidden Markov states labelled by i (1 ≤ i ≤ N), and M possible observables for each state, labelled by a (1 ≤ a ≤ M). The state transition probabilies are pij = p(qt+1 = j | qt = i), 1 ≤ i, j ≤ N (where qt is the hidden state at time t), the emission probability for the observable a from state i is ei(a) = p(Ot = a | qt = i) (where Ot is the observation at time t), and t...

متن کامل

Adjusted Viterbi Training. A proof of concept

Viterbi Training (VT) provides a fast but inconsistent estimator of Hidden Markov Models (HMM). The inconsistency is alleviated with little extra computation when we enable VT to asymptotically fix the true values of the parameters. This relies on infinite Viterbi alignments and associated with them limiting probability distributions. First in a sequel, this paper is a proof of concept; it focu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006